Structure discovery in mixed order hyper networks
نویسندگان
چکیده
منابع مشابه
Structure discovery in mixed order hyper networks
Correspondence: [email protected] Computing and Mathematics, University of Stirling, FK9 4LA Stirling, UK Abstract Background: Mixed Order Hyper Networks (MOHNs) are a type of neural network in which the interactions between inputs are modelled explicitly by weights that can connect any number of neurons. Such networks have a human readability that networks with hidden units lack. They can be u...
متن کاملTraining and making calculations with mixed order hyper-networks
A neural network with mixed order weights, n neurons and a modified Hebbian learning rule can learn any function f : {−1, 1}n → R and reproduce its output as the network’s energy function. The network weights are equal to Walsh coefficients, the fixed point attractors are local maxima in the function, and partial sums across the weights of the network calculate averages for hyperplanes through ...
متن کاملPartial Order MCMC for Structure Discovery in Bayesian Networks
We present a new Markov chain Monte Carlo method for estimating posterior probabilities of structural features in Bayesian networks. The method draws samples from the posterior distribution of partial orders on the nodes; for each sampled partial order, the conditional probabilities of interest are computed exactly. We give both analytical and empirical results that suggest the superiority of t...
متن کاملStructure Discovery in Biology: Motifs, Networks & Phylogenies
From 15.07.12 to 20.07.12, the Dagstuhl Seminar 12291 “Structure Discovery in Biology: Motifs, Networks & Phylogenies” was held in Schloss Dagstuhl – Leibniz Center for Informatics. The seminar was in part a follow-up to Dagstuhl Seminar 10231, held in June 2010, this time with a strong emphasis on large data. Both veterans and new participants took part in this edition. During the seminar, sev...
متن کاملExact Bayesian Structure Discovery in Bayesian Networks
Learning a Bayesian network structure from data is a well-motivated but computationally hard task. We present an algorithm that computes the exact posterior probability of a subnetwork, e.g., a directed edge; a modified version of the algorithm finds one of the most probable network structures. This algorithm runs in time O(n2n + nk+1C(m)), where n is the number of network variables, k is a con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Big Data Analytics
سال: 2016
ISSN: 2058-6345
DOI: 10.1186/s41044-016-0009-x